THE ACCUMULATED EXPERIENCE ANT COLONY FOR THE TRAVELING SALESMAN PROBLEM
نویسندگان
چکیده
منابع مشابه
The Accumulated Experience Ant Colony for the Traveling Salesman Problem
Ant colony optimization techniques are usually guided by pheromone and heuristic cost information when choosing the next element to add to a solution. However, while an individual element may be attractive, usually its long term consequences are neither known nor considered. For instance, a short link in a traveling salesman problem may be incorporated into an ant’s solution, yet, as a conseque...
متن کاملThe Accumulated Experience Ant Colony for the Travelling Salesman Problem
Ant colony optimisation techniques are usually guided by pheromone and heuristic cost information when choosing the next element to add to a solution. However, while an individual element may be attractive, usually its long term consequences are neither known nor considered. For instance, a short link in a TSP may be incorporated into an ant’s solution, yet, as a consequence of this link, the r...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملParallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...
متن کاملAnt Colony Component-based System for Traveling Salesman Problem
A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence and Applications
سال: 2003
ISSN: 1469-0268,1757-5885
DOI: 10.1142/s1469026803000938